ETROITESSE DES LIMITES DU CODAGE ALEATOIRE POUR LES CANAUX DE RADIODIFFUSIONPOLTYREV G SH.1982; PROBLEMS OF CONTROL AND INFORMATION THEORY; ISSN 0370-2529; HUN; DA. 1982; VOL. 11; NO 5; PP. 353-364; ABS. ENG; BIBL. 4 REF.Article

CODAGE PSEUDOSTOCHASTIQUE PAR N-PARTITION DANS LES SYSTEMES A RETROACTION DECISIVEUSTINOV GN.1982; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1982; VOL. 18; NO 1; PP. 43-50; BIBL. 5 REF.Article

BORNES DE CODAGE ALEATOIRE POUR LES CANAUX DISCRETS SANS MEMOIREPOLTYREV G SH.1982; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1982; VOL. 18; NO 1; PP. 12-26; BIBL. 15 REF.Article

PLANS D'EXPERIENCE FACTORIELS REDUITS DANS LE CAS D'UNE FONCTION DE REPONSE NON SYMETRIQUEMALYUTOV MB; MATEEV PS.1979; DOKL. AKAD NAUK S.S.S.R.; SUN; DA. 1979; VOL. 244; NO 1; PP. 42-46; BIBL. 4 REF.Article

PROBLEME DE CODAGE SEPARE DE DEUX SOURCES CORRELEESKOSHELEV VN.1977; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1977; VOL. 13; NO 1; PP. 26-32; BIBL. 3 REF.Article

CODAGE UNIVERSEL UNIFORME DES SOURCES DE BERNOULLI A LA SORTIETROFIMOV VK.1976; DISKRETN. ANAL.; S.S.S.R.; DA. 1976; NO 29; PP. 87-100; BIBL. 14 REF.Article

RANDOM CODING STRATEGIES FOR MINIMUM ENTROPY.POSNER EC.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 4; PP. 388-391; BIBL. 8 REF.Article

BEST EXPONENTIAL UPPER BOUNDS TO ERROR PROBABILITY OBTAINABLE BY RANDOM CODING FOR BINARY SYMMETRIC CHANNELSKAMBO NS; SAMAR SINGH.1972; INFORM. AND CONTROL; U.S.A.; DA. 1972; VOL. 21; NO 3; PP. 261-279; BIBL. 10 REF.Serial Issue

THE CAPACITY REGION FOR THE DETERMINISTIC BROADCAST CHANNEL WITH A COMMON MESSAGETE SUN HAN.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 1; PP. 122-125; BIBL. 15 REF.Article

GOOD CODES CAN BE PRODUCED BY A FEW PERMUTATIONSAHLSWEDE R; DUECK G.1982; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 3; PP. 430-443; BIBL. 26 REF.Article

COMPUTATION OF RANDOM CODING EXPONENT FUNCTIONS.ARIMOTO S.1976; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1976; VOL. 22; NO 6; PP. 665-671; BIBL. 14 REF.Article

RANDOM CODING THEOREMS FOR THE GENERAL DISCRETE MEMORYLESS BROADCAST CHANNEL.VAN DER MEULEN EC.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 2; PP. 180-190; BIBL. 15 REF.Article

GENAUIGKEIT UND BANDBREITE IN DER STOCHASTISCHEN RECHENTECHNIK. = PRECISION ET LARGEUR DE BANDE DANS LA TECHNIQUE DE CALCUL STOCHASTIQUEMASSEN R; KOHL A.1975; ELEKTRONIK; DTSCH.; DA. 1975; VOL. 24; NO 8; PP. 81-84; BIBL. 2 REF.Article

BORNES DE LA LONGUEUR DES CODES DISJONCTIFSD'YACHKOV AG; RYKOV VV.1982; PROBLEMY PEREDACI INFORMACII; ISSN 0555-2923; SUN; DA. 1982; VOL. 18; NO 3; PP. 7-13; BIBL. 4 REF.Article

PROBABILITE D'ERREUR DANS LES PROBLEMES DE RECONNAISSANCE AVEC UN DICTIONNAIRE ALEATOIREFAJN VS.1979; PROBL. PEREDACHI INFORM.; SUN; DA. 1979; VOL. 15; NO 2; PP. 106-108; BIBL. 3 REF.Article

EINFUEHRUNG IN DIE STOCHASTISCHE RECHENTECHNIK. = INTRODUCTION AU CALCUL STOCHASTIQUEKOHL A.1977; FREQUENZ; DTSCH.; DA. 1977; VOL. 31; NO 10; PP. 315-319; ABS. ANGL.; BIBL. 13 REF.Article

BORNE INFERIEURE DE LA PROBABILITE D'ERREUR POUR LES CANAUX A ACCES MULTIPLEARUTYUNYAN EA.1975; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1975; VOL. 11; NO 2; PP. 23-36; BIBL. 6 REF.Article

A DIRECT PROOF OF THE CODING THEOREM FOR DISCRETE SOURCES WITH MEMORY.DAVISSON LD; PURSLEY MB.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 3; PP. 310-317; BIBL. 15 REF.Article

CODAGE UNIVERSEL A PLUSIEURS NIVEAUX DANS LES CANAUX DISCRETS A RETROACTIONFINK LM; KORZHIK VI.1978; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1978; VOL. 14; NO 2; PP. 40-45; BIBL. 3 REF.Article

Security analysis of optical encryptionFRAUEL, Yann; CASTRO, Albertina; NAUGHTON, Thomas J et al.Proceedings of SPIE, the International Society for Optical Engineering. 2005, pp 598603.1-598603.10, issn 0277-786X, isbn 0-8194-6008-7, 1VolConference Paper

A new optical random coding technique for security systemsZALEVSKY, Z; MENDLOVIC, D; LEVY, U et al.Optics communications. 2000, Vol 180, Num 1-3, pp 15-20, issn 0030-4018Article

Yarrow-160 : Notes on the design and analysis of the Yarrow cryptographic pseudorandom number generatorKELSEY, J; SCHNEIER, B; FERGUSON, N et al.Lecture notes in computer science. 2000, pp 13-33, issn 0302-9743, isbn 3-540-67185-4Conference Paper

New lower bounds for binary codes of asymmetric distance twoZHEN ZHANG; XIANG-GEN XIA.IEEE transactions on information theory. 1992, Vol 38, Num 5, pp 1592-1597, issn 0018-9448Article

A branching process analysis of the stack algorithm for variable channel conditionsMONTPETIT, M.-J; HACCOUN, D; DESLAURIERS, G et al.IEEE transactions on information theory. 1992, Vol 38, Num 6, pp 1845-1848, issn 0018-9448Article

Random code chainingLEE, J. Y; LU, E. H; CHEN, P. C. H et al.Electronics Letters. 1988, Vol 24, Num 10, pp 579-580, issn 0013-5194Article